Iterative Methods for Computing Generalized Inverses of Matrices
نویسنده
چکیده
AB:The subject of investigation of the doctoral dissertation is the calculation ofgeneralized inverses of matrices, as well as the connection between thegeneralized inverses of matrices with the optimization theory concepts. Thereare defined new iterative methods for solving optimization problems. Aspecial attention is devoted on defining new iterative methods for generalizedinverses calculation. The defined methods enables efficient calculation ofgeneralized inverses, as well an analysis of their properties. The contributionof the doctoral dissertation is in the field of generalized inverses, as well, inthe field of unconstrained optimization theory. This is claimed by the proposalof the new effective algorithms which can be compared to the most favorableones in their disciplines. Accepted by the Scientific Board on, ASB: 26.12.2011Defended on, DE: Defended Board, DB: President:
منابع مشابه
A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملSome Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations
An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical equations is considered. With the aim to illustrate proposed algorithms, an improved high order hyper-power matrix iterative method for computing generalized inverses is introduced and applied. The improvements of the hyper-power iterative scheme are based on its proper factorization, as well as on...
متن کاملIterative methods for computing generalized inverses
In this article we extend the method of Yong-Lin Chen (Iterative methods for computing the generalized inverses A (2) T,S of a matrix A, Appl. Math. Comput. 75 (2-3) (1996)) to inifinite dimensional settings. Precisely, we construct an iterative method for computing outer generalized inverses of operators on Banach spaces, and also for computing the generalized Drazin inverse of Banach algebra ...
متن کاملUniversal Iterative Methods for Computing Generalized Inverses
In this paper we construct a few iterative processes for computing {1, 2} inverses of a linear bounded operator, based on the hyper-power iterative method or the Neumann-type expansion. Under the suitable conditions these methods converge to the {1, 2, 3} or {1, 2, 4} inverses. Also, we specify conditions when the iterative processes converge to the Moore-Penrose inverse, the weighted Moore-Pen...
متن کامل